A Sampling Framework for Solving Physics-Driven Inverse Source Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A numerical Algorithm Based on Chebyshev Polynomials for Solving some Inverse Source Problems

In this paper‎, two inverse problems of determining an unknown source term in a parabolic‎ equation are considered‎. ‎First‎, ‎the unknown source term is ‎estimated in the form of a combination of Chebyshev functions‎. ‎Then‎, ‎a numerical algorithm based on Chebyshev polynomials is presented for obtaining the solution of the problem‎. ‎For solving the problem‎, ‎the operational matrices of int...

متن کامل

Unfolding in particle physics: A window on solving inverse problems

Unfolding is the ensemble of techniques aimed at resolving inverse, ill-posed problems. A pedagogical introduction to the origin and main problems related to unfolding is presented and used as the the stepping stone towards the illustration of some of the most common techniques that are currently used in particle physics experiments.

متن کامل

A Memetic Framework for Solving Difficult Inverse Problems

The paper introduces a multi-deme, memetic global optimization strategy Hierarchic memetic Strategy (HMS) especially wellsuited to the solution of a class of parametric inverse problems. This strategy develops dynamically a tree of dependent populations (demes) searching with the various accuracy growing from the root to the leaves. The search accuracy is associated with the accuracy of solving...

متن کامل

Versatile and scalable cosparse methods for physics-driven inverse problems

Solving an underdetermined inverse problem implies the use of a regularization hypothesis. Among possible regularizers, the so-called sparsity hypothesis, described as a synthesis model of the signal of interest from a low number of elementary signals taken in a dictionary, is now widely used. In many inverse problems of this kind, it happens that an alternative model, the cosparsity hypothesis...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2017

ISSN: 1053-587X,1941-0476

DOI: 10.1109/tsp.2017.2742983